منابع مشابه
Median and Center of Zero-Divisor Graph of Commutative Semigroups
For a commutative semigroup S with 0, the zero-divisor graph of S denoted by &Gamma(S) is the graph whose vertices are nonzero zero-divisor of S, and two vertices x, y are adjacent in case xy = 0 in S. In this paper we study median and center of this graph. Also we show that if Ass(S) has more than two elements, then the girth of &Gamma(S) is three.
متن کاملThe periphery graph of a median graph
The periphery graph of a median graph is the intersection graph of its peripheral subgraphs. We show that every graph without a universal vertex can be realized as the periphery graph of a median graph. We characterize those median graphs whose periphery graph is the join ∗Work supported by the Ministry of Science of Slovenia and by the Ministry of Science and Technology of India under the bila...
متن کاملA New Median Graph Algorithm
Median graph is an important new concept introduced to represent a set of graphs by a representative graph. Computing the median graph is an NPComplete problem. In this paper, we propose an approximate algorithm for computing the median graph. Our algorithm performs in two steps. It first carries out a node reduction process using a clustering method to extract a subset of most representative n...
متن کاملGraph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph
In this paper we propose the application of the generalized median graph in a graph-based k -means clustering algorithm. In the graph-based k -means algorithm, the centers of the clusters have been traditionally represented using the set median graph. We propose an approximate method for the generalized median graph computation that allows to use it to represent the centers of the clusters. Exp...
متن کاملOn Median Graphs and Median Grid Graphs on Median Graphs and Median Grid Graphs
Let e be an edge of a median graph G which is contained in exactly one 4-cycle. Then it is proved that G n e is a median graph. The converse holds as well provided that e is not contained is a subgraph isomorphic to the 3-cube minus a vertex. These results are used to give several characterizations of median grid graphs. (Grid graphs are subgraphs of complete grids, i.e. of the Cartesian produc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Discrete Mathematics
سال: 2012
ISSN: 2090-7788
DOI: 10.5402/2012/583671